ANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION
Authors
Abstract:
This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysis is carried out using particle swarm optimization. Computational experiences with a variety of numerical results are discussed.
similar resources
analysis of a discrete-time impatient customer queue with bernoulli-schedule vacation interruption
this paper investigates a discrete-time impatient customer queue with bernoulli-schedule vacation interruption. the vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. we obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. cost an...
full textImpatient customer queue with Bernoulli schedule vacation interruption
This paper investigates a discrete-time impatient customer queue with Bernoullischedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer’s observation epochs using recursive technique. Cost analysis ...
full textON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION
This paper analyzes a renewal input working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a
full texton (a,c,b) policy queue with change over times under bernoulli schedule vacation interruption
this paper analyzes a renewal input working vacations queue with change over times and bernoulli schedulevacation interruption under (a,c,b) policy.the service and vacation times are exponentially distributed.the server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a
full textAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
full textFinite Buffer GI/M(n)/1 Queue with Bernoulli-Schedule Vacation Interruption under N-Policy
We study a finite buffer N-policy GI/M(n)/1 queue with Bernoulli-schedule vacation interruption. The server works with a slower rate during vacation period. At a service completion epoch during working vacation, if there are at least N customers present in the queue, the server interrupts vacation and otherwise continues the vacation. Using the supplementary variable technique and recursive met...
full textMy Resources
Journal title
volume 6 issue 2 (Spring)
pages 119- 128
publication date 2016-03-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023